Elliptic approximations of propositional formulae
نویسندگان
چکیده
منابع مشابه
Elliptic Approximations of Propositional Formulae
A propositional formula can be approximated by a concave quadratic function. This approximation is obtained as a second order Taylor expansion of a convex smooth model. It is shown that in the 3-SAT case, the involved parameters can be set to such values that yield optimal discriminative properties. Two concentric (generally elliptic) quadratic convex regions are established, the inner one cont...
متن کاملVivifying Propositional Clausal Formulae
In this paper, we present a new way to preprocess Boolean formulae in Conjunctive Normal Form (CNF). In contrast to most of the current pre-processing techniques, our approach aims at improving the filtering power of the original clauses while producing a small number of additional and relevant clauses. More precisely, an incomplete redundancy check is performed on each original clauses through...
متن کاملThe universe of propositional approximations
The idea of approximate entailment has been proposed by Schaerf and Cadoli [Tractable reasoning via approximation, Artif. Intell. 74(2) (1995) 249–310] as a way of modelling the reasoning of an agent with limited resources. In that framework, a family of logics, parameterised by a set of propositional letters, approximates classical logic as the size of the set increases. The original proposal ...
متن کاملSemantic Minimization of 3-Valued Propositional Formulae
Abstract This paper presents an algorithm for a non-standard logicminimization problem that arises in -valued propositional logic. The problem is motivated by the potential for obtaining better answers in applications that use -valued logic. An answer of or provides precise (definite) information; an answer of provides imprecise (indefinite) information. By replacing a formula with a “better” f...
متن کاملAlgorithms for computing backbones of propositional formulae
The problem of propositional satisfiability (SAT) has found a number of applications in both theoretical and practical computer science. In many applications, however, knowing a formula’s satisfiability alone is insufficient. Often, some other properties of the formula need to be computed. This article focuses on one such property: the backbone of a formula, which is the set of literals that ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1999
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(99)00041-4